<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    485. Max Consecutive Ones
   </h1>
   <p>
    Given a binary array, find the maximum number of consecutive 1s in this array.
   </p>
   <p>
    <b>
     Example 1:
    </b>
    <br>
   </p>
   <pre>
<b>Input:</b> [1,1,0,1,1,1]
<b>Output:</b> 3
<b>Explanation:</b> The first two digits or the last three digits are consecutive 1s.
    The maximum number of consecutive 1s is 3.
</pre>
   <p>
    <b>
     Note:
    </b>
   </p>
   <ul>
    <li>
     The input array will only contain
     <code>
      0
     </code>
     and
     <code>
      1
     </code>
     .
    </li>
    <li>
     The length of input array is a positive integer and will not exceed 10,000
    </li>
   </ul>
  </div>
  <div>
   <h1 class="question_title">
    485. 最大连续1的个数
   </h1>
   <p>
    给定一个二进制数组， 计算其中最大连续1的个数。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre>
<strong>输入:</strong> [1,1,0,1,1,1]
<strong>输出:</strong> 3
<strong>解释:</strong> 开头的两位和最后的三位都是连续1，所以最大连续1的个数是 3.
</pre>
   <p>
    <strong>
     注意：
    </strong>
   </p>
   <ul>
    <li>
     输入的数组只包含&nbsp;
     <code>
      0
     </code>
     和
     <code>
      1
     </code>
     。
    </li>
    <li>
     输入数组的长度是正整数，且不超过 10,000。
    </li>
   </ul>
  </div>
 </body>
</html>